Resolution is Not Automatizable Unless W[P] is Tractable
نویسندگان
چکیده
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomized algorithms with one-sided error.
منابع مشابه
Ethics Governing International Investment Contracts unless the Applicable Law is Established
Background: Settlement of disputes arising from foreign investment may be possible if the governing law is clear. Irrespective of international treaties, since the legal relationship between the investor and the investee is often included in investment contracts, the law governing such contracts is determined. But there are cases where the ruling law has not been determined. In this case, three...
متن کاملA Parity Games and Propositional Proofs
A propositional proof system is weakly automatizable if there is a polynomial time algorithm which separates satisfiable formulas from formulas which have a short refutation in the system, with respect to a given length bound. We show that if the resolution proof system is weakly automatizable, then parity games can be decided in polynomial time. We give simple proofs that the same holds for de...
متن کاملOn the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Maximum Common Induced Subgraph (henceforth MCIS) is among the most studied classical NP-hard problems. MCIS remains NP-hard on many graph classes including bipartite graphs, planar graphs and k-trees. Little is known, however, about the parameterized complexity of the problem. When parameterized by the vertex cover number of the input graphs, the problem was recently shown to be fixed-paramete...
متن کاملOn the Automatizability of Resolution and Related Propositional Proof Systems
Having good algorithms to verify tautologies as efficiently as possible is of prime interest in different fields of computer science. In this paper we present an algorithm for finding Resolution refutations based on finding tree-like Res(k) refutations. The algorithm is based on the one of Beame and Pitassi [4] for tree-like Resolution, but it is provably more efficient. On the other hand our a...
متن کاملScanning hall probe microscopy technique for investigation of magnetic properties
Scanning Hall Probe Microscopy (SHPM) is a scanning probe microscopy technique developed to observe and image magnetic fields locally. This method is based on application of the Hall Effect, supplied by a micro hall probe attached to the end of cantilever as a sensor. SHPM provides direct quantitative information on the magnetic state of a material and can also image magnetic induction under a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001